/// @tags:
#include <cstdio>
#include <functional>
#include <iostream>
#include <numeric>

using std::cin, std::cout, std::endl;

namespace BlueQuantum {

using ll = long long;

constexpr int maxn = 100;

struct Node {
  int t, d;
} spl[maxn + 1];

bool check(int mid, int n) {
  std::sort(spl + 1, spl + 1 + n,
            [](const Node& a, const Node& b) { return a.t * b.d < b.t * a.d; });
}

int main() {
  int n, h;
  cin >> n >> h;
  for (int i = 1; i <= n; ++i) {
    cin >> spl[i].t >> spl[i].d;
  }

  ll l = 0, r = 2e9, ans;
  while (l < r) {
    int mid = (l + r) / 2;
    if (check(mid, n)) {
      ans = mid;
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  cout << ans << endl;
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("F - Damage over Time.in", "r", stdin);
  freopen("F - Damage over Time.out", "w", stdout);
#endif
#endif

  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
